Pathak’s “computational” Lebesgue differentiation theorem in context
نویسنده
چکیده
These are working notes on placing Pathak’s [5] computability-flavored version of the Lebesgue differentiation theorem into the framework developed by Hoyrup and Rojas [3, 1, 2] for working with algorithmic randomness in “computable metric spaces.” I wrote this up for my own edification, as I am only just becoming familiar with algorithmic randomness in general.
منابع مشابه
A computational aspect of the Lebesgue differentiation theorem
Given an L1 -computable function, f , we identify a canonical representative of the equivalence class of f , where f and g are equivalent if and only if ∫ |f − g| is zero. Using this representative, we prove a modified version of the Lebesgue Differentiation Theorem. Our theorem is stated in terms of Martin-Löf random points in Euclidean space. 2000 Mathematics Subject Classification 03D80 (pri...
متن کاملPolynomial Space Randomness in Analysis with Application to the Lebesgue Differentiation Theorem
We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko’s framework for polynomial space computability in Rn to define weakly pspace-random points, a new variant of polynomial space randomness. We show that the Lebesgue differentiation theorem holds for every weakly pspace-random point.
متن کاملSchnorr Randomness and the Lebesgue Differentiation Theorem
We exhibit a close correspondence between L1-computable functions and Schnorr tests. Using this correspondence, we prove that a point x ∈ [0, 1] is Schnorr random if and only if the Lebesgue Differentiation Theorem holds at x for all L1-computable functions f ∈ L1([0, 1]).
متن کاملFundamental Theorem of Calculus for Lebesgue Integration
The existing proofs of the Fundamental theorem of calculus for Lebesgue integration typically rely either on the Vitali–Carathéodory theorem on approximation of Lebesgue integrable functions by semi-continuous functions (as in [3, 9, 12]), or on the theorem characterizing increasing functions in terms of the four Dini derivates (as in [6, 10]). Alternatively, the theorem is derived using the Pe...
متن کاملPolynomial Space Randomness in Analysis
We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko’s framework for polynomial space computability in R to define weakly pspace-random points, a new variant of polynomial space randomness. We show that the Lebesgue differentiation theorem characterizes weakly pspace random points. That is, a po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009